On the Diophantine equation (xm-1)/(x-1) = (yn-1)/(y-1)

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ON THE DIOPHANTINE EQUATION x m − 1 x − 1 = yn − 1 y − 1

There is no restriction in assuming that y > x in (1) and thus we have m > n. This equation asks for integers having all their digits equal to one with respect to two distinct bases and we still do not know whether or not it has finitely many solutions. Even if we fix one of the four variables, it remains an open question to prove that (1) has finitely many solutions. However, when either the b...

متن کامل

ON THE DIOPHANTINE EQUATION Ax2+22m =yn

Let h denote the class number of the quadratic field Q( √−A) for a square free odd integer A> 1, and suppose that n> 2 is an odd integer with (n,h)= 1 and m> 1. In this paper, it is proved that the equation of the title has no solution in positive integers x and y if n has any prime factor congruent to 1 modulo 4. If n has no such factor it is proved that there exists at most one solution with ...

متن کامل

THE DIOPHANTINE EQUATION x2+2k =yn, II

New results regarding the full solution of the diophantine equationx2+2k=yn in positive integers are obtained. These support a previous conjecture, without providing a complete proof.

متن کامل

ON THE DIOPHANTINE EQUATION xn − 1 x −

We prove that if (x, y, n, q) 6= (18, 7, 3, 3) is a solution of the Diophantine equation (xn−1)/(x−1) = y with q prime, then there exists a prime number p such that p divides x and q divides p − 1. This allows us to solve completely this Diophantine equation for infinitely many values of x. The proofs require several different methods in diophantine approximation together with some heavy comput...

متن کامل

On the Diophantine equation |axn - byn | = 1

If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptions of (a, b, n) satisfying b = a + 1, 2 ≤ a ≤ min{0.3n, 83} and 17 ≤ n ≤ 347. The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 2002

ISSN: 0030-8730

DOI: 10.2140/pjm.2002.207.61